Aitken-Steffensen acceleration and a new addition formula for Fibonacci numbers
نویسندگان
چکیده
منابع مشابه
Aitken Sequences and Generalized Fibonacci Numbers
Consider the sequence (t>„) generated by t>„+ ¡ = avn bv,l_l, n 5¡ 2, where v¡ = 1, t>2 = a, with a and b real, of which the Fibonacci sequence is a special case. It is shown that if Aitken acceleration is used on the sequence (x„) defined by a„ = v„+1/v„, the resulting sequence is a subsequence of (jc„). Second, if Newton's method and the secant method are used (with suitable starting values) ...
متن کاملA Simplified Binet Formula for k-Generalized Fibonacci Numbers
In this paper, we present a particularly nice Binet-style formula that can be used to produce the k-generalized Fibonacci numbers (that is, the Tribonaccis, Tetranaccis, etc.). Furthermore, we show that in fact one needs only take the integer closest to the first term of this Binet-style formula in order to generate the desired sequence.
متن کاملEnergy of Graphs, Matroids and Fibonacci Numbers
The energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. In this article we consider the problem whether generalized Fibonacci constants $varphi_n$ $(ngeq 2)$ can be the energy of graphs. We show that $varphi_n$ cannot be the energy of graphs. Also we prove that all natural powers of $varphi_{2n}$ cannot be the energy of a matroid.
متن کاملA New Generalization of Fibonacci Sequence and Extended Binet’s Formula
Consider the Fibonacci sequence {Fn}n=0 with initial conditions F0 = 0, F1 = 1 and recurrence relation Fn = Fn−1 + Fn−2 (n ≥ 2). The Fibonacci sequence has been generalized in many ways, some by preserving the initial conditions, and others by preserving the recurrence relation. In this article, we study a new generalization {qn}, with initial conditions q0 = 0 and q1 = 1, which is generated by...
متن کاملA Combinatoric Proof and Generalization of Ferguson’s Formula for k-generalized Fibonacci Numbers
Various generalizations of the Fibonacci numbers have been proposed, studied and applied over the years (see [5] for a brief list). Probably the best known are the k-generalized Fibonacci numbers F (k) n (also known as the k-fold Fibonacci, k-th order Fibonacci, k-Fibonacci or polynacci numbers), satisfying F (k) n = F (k) n−1 + F (k) n−2 + . . .+ F (k) n−k , n ≥ k , F (k) n = 0 , 0 ≤ n ≤ k − 2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Japan Academy, Series A, Mathematical Sciences
سال: 1986
ISSN: 0386-2194
DOI: 10.3792/pjaa.62.5